Handle slides for delta-matroids
نویسندگان
چکیده
A classic exercise in the topology of surfaces is to show that, using handle slides, every disc-band surface, or 1-vertex ribbon graph, can be put in a canonical form consisting of the connected sum of orientable loops, and either non-orientable loops or pairs of interlaced orientable loops. Motivated by the principle that ribbon graph theory informs delta-matroid theory, we find the delta-matroid analogue of this surface classification. We show that, using a delta-matroid analogue of handle slides, every binary delta-matroid in which the empty set is feasible can be written in a canonical form consisting of the direct sum of the delta-matroids of orientable loops, and either non-orientable loops or pairs of interlaced orientable loops. Our delta-matroid results are compatible with the surface results in the sense that they are their ribbon graphic delta-matroidal analogues.
منابع مشابه
The Structure of Delta-Matroids with Width One Twists
The width of a delta-matroid is the difference in size between a maximal and minimal feasible set. We give a Rough Structure Theorem for delta-matroids that admit a twist of width one. We apply this theorem to give an excluded-minor characterisation of delta-matroids that admit a twist of width at most one.
متن کاملExcluding a bipartite circle graph from line graphs
We prove that for fixed bipartite circle graph H, all line graphs with sufficiently large rank-width (or clique-width) must contain an isomorphic copy of H as a pivotminor. To prove this, we introduce graphic delta-matroids. Graphic delta-matroids are minors of delta-matroids of line graphs and they generalize graphic or cographic matroids.
متن کاملOperations on M-Convex Functions on Jump Systems
A jump system is a set of integer points with an exchange property, which is a generalization of a matroid, a delta-matroid, and a base polyhedron of an integral polymatroid (or a submodular system). Recently, the concept of M-convex functions on constant-parity jump systems is introduced by Murota as a class of discrete convex functions that admit a local criterion for global minimality. M-con...
متن کاملInductive tools for connected delta-matroids and multimatroids
We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs. © 2017 Elsevier Ltd. All rights reserved.
متن کاملDelta-Matroids, Jump Systems, and Bisubmodular Polyhedra
We relate an axiomatic generalization of matroids, called a jump system, to poly-hedra arising from bisubmodular functions. Unlike the case for usual submodularity, the points of interest are not all the integral points in the relevant polyhedron, but form a subset of them. However, we do show that the convex hull of the set of points of a jump system is a bisubmodular polyhedron, and that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 59 شماره
صفحات -
تاریخ انتشار 2017